Selecting a routing strategy for your ad hoc network

In this paper we investigate the performance of routing strategies in ad hoc networks. An ad hoc network operates without a central entity or infrastructure, and is composed of highly mobile network hosts. In this environment, routes tend to be multihop and routing protocols are faced with host mobility and bandwidth constraints. In recent years, numerous routing protocols of different styles have been proposed. Traditional table-driven protocols (distance vector, link state), reactive on-demand protocols, and location-based protocols that use position information provided by GPS are the most commonly used strategies. Using PARSEC, we simulate protocols that represent these various routing strategies. The protocols are evaluated in different network scenarios. Relative strengths, weaknesses, and applicability to various situations of each routing protocol are studied and discussed. q 2002 Published by Elsevier Science B.V.